Papers with autoregressive fashion
Multilingual Autoregressive Entity Linking (2022.tacl-1)
Copied to clipboard
Nicola De Cao, Ledell Wu, Kashyap Popat, Mikel Artetxe, Naman Goyal, Mikhail Plekhanov, Luke Zettlemoyer, Nicola Cancedda, Sebastian Riedel, Fabio Petroni
| Challenge: | mGENRE is a sequence-to-sequence system for multilingual entity linking . mGenRE is used to solve language-specific mentions to a multilingual Knowledge Base . |
| Approach: | They propose a sequence-to-sequence system for multilingual entity linking . they match language-specific mentions against a multilingual Knowledge Base (KB) mGENRE is a sequential system that predicts the name of the target entity token-by-token . |
| Outcome: | The proposed system improves on three popular MEL benchmarks and shows improvements in accuracy. |
Semantic-aware Contrastive Learning for More Accurate Semantic Parsing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on semantic parsing use Maximum Likelihood Estimation (MLE) to train discriminative semantic parses. |
| Approach: | They propose a semantic-aware contrastive learning algorithm which can learn to distinguish fine-grained meaning representations and take the overall sequence-level semantic into consideration. |
| Outcome: | The proposed algorithm improves on two standard datasets and gets state-of-the-art performance over existing methods. |
Efficient Transformers with Dynamic Token Pooling (2023.acl-long)
Copied to clipboard
| Challenge: | Hourglass Transformers is a computationally efficient model that can be used to reduce the sequence length in the intermediate layers. |
| Approach: | They propose a dynamic-pooling mechanism which predicts segment boundaries in an autoregressive fashion. |
| Outcome: | The proposed model is faster and more accurate than vanilla Transformers and fixed-length pooling within the same computational budget. |